
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1619. -- [Usaco2008 Nov]Guarding the Farm -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1619: [Usaco2008 Nov]Guarding the Farm</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>189&nbsp;&nbsp;<span class=green>Solved: </span>72<br>[<a href='submitpage.php?id=1619'>Submit</a>][<a href='problemstatus.php?id=1619'>Status</a>][<a href='bbs.php?id=1619'>Discuss</a>]</center><h2>Description</h2><div class=content>The farm has many hills upon which Farmer John would like to place
guards to ensure the safety of his valuable milk-cows.

He wonders how many guards he will need if he wishes to put one on
top of each hill. He has a map supplied as a matrix of integers;
the matrix has N (1 < N <= 700) rows and M (1 < M <= 700) columns.
Each member of the matrix is an altitude H_ij (0 <= H_ij <= 10,000).
Help him determine the number of hilltops on the map.

A hilltop is one or more adjacent matrix elements of the same value
surrounded exclusively by either the edge of the map or elements
with a lower (smaller) altitude. Two different elements are adjacent
if the magnitude of difference in their X coordinates is no greater
than 1 and the magnitude of differences in their Y coordinates is
also no greater than 1.


农夫JOHN的农夫上有很多小山丘，他想要在那里布置一些保镖（……）
去保卫他的那些相当值钱的奶牛们。 

他想知道如果在一座小山丘上布置一名保镖的话，他总共需要招聘多少名保镖。
他现在手头有一个用数字矩阵来表示地形的地图。这个矩阵有N行
（1 < N < = 100)和M列( 1 < M < = 70)
。矩阵中的每个元素都有一个值H_ij(0 < = H_ij < =10,000)来表示该地区的海拔高度。请你帮助
他统计出地图上到底有多少个小山丘。 

小山丘的定义是：若地图中一个元素所邻接的所有元素都比这个元素高度要小（或它邻接的是地图的边界）
，则该元素和其周围所有按照这样顺序排列的元素的集合称为一个小山丘。这里邻接的意义是：
若一个元素与另一个横坐标纵坐标和它的横纵坐标相差不超过1，则称这两个元素邻接。 

问题名称：guard 

输入格式： 

第一行：两个由空格隔开的整数N和M 第二行到第N+1行：第I+1行描述了地图上的第I行，
有M个由空格隔开的整数：H_ij. 输入样例：(guard.in): 

8 7 

4 3 2 2 1 0 1 

3 3 3 2 1 0 1 

2 2 2 2 1 0 0 

2 1 1 1 1 0 0 

1 1 0 0 0 1 0 

0 0 0 1 1 1 0 

0 1 2 2 1 1 0 

0 1 1 1 2 1 0 

输出格式: 

第一行：小山丘的个数 输出样例：(guard.out): 

3 

输出样例解释： 

地图上有三个小山丘：每个小山丘的山峰位置分别在左上角（高度为4），右上角（高度为1）和底部（高度为2）。</div><h2>Input</h2><div class=content>* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: Line i+1 describes row i of the matrix with M
        space-separated integers: H_ij

</div><h2>Output</h2><div class=content>* Line 1: A single integer that specifies the number of hilltops

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>8 7<br />
4 3 2 2 1 0 1<br />
3 3 3 2 1 0 1<br />
2 2 2 2 1 0 0<br />
2 1 1 1 1 0 0<br />
1 1 0 0 0 1 0<br />
0 0 0 1 1 1 0<br />
0 1 2 2 1 1 0<br />
0 1 1 1 2 1 0<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>3<br />
<br />
OUTPUT DETAILS:<br />
<br />
There are three peaks: The one with height 4 on the left top, one of<br />
the points with height 2 at the bottom part, and one of the points with<br />
height 1 on the right top corner.<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1619'>Submit</a>][<a href='problemstatus.php?id=1619'>Status</a>][<a href='bbs.php?id=1619'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
